A New Built-in TPG Based on Berlekamp-Massey Algorithm

نویسندگان

  • Cleonilson Protásio de Souza
  • Francisco Marcos de Assis
  • Raimundo Carlos Silvério Freire
چکیده

In this work, a new method to design a mixedmode Test Pattern Generator (TPG) based only on a simple and single Linear Feedback Shift Register (LFSR) is described. Such an LFSR is synthesized by Berlekamp–Massey algorithm (BMA) and is capable of generating pre-computed deterministic test patterns which detect the hard-to-detect faults of the circuit. Moreover, the LFSR generates residual patterns which are sufficient to detect the remaining easy-to-detect faults. In this way, the BMA-designed LFSR is a mixedmode TPG which achieves total fault coverage with short testing length and low hardware overhead compared with previous schemes according to the experimental results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A On The Matrix Berlekamp-Massey Algorithm

We analyze the Matrix Berlekamp/Massey algorithm, which generalizes the Berlekamp/Massey algorithm [Massey 1969] for computing linear generators of scalar sequences. The Matrix Berlekamp/Massey algorithm computes a minimal matrix generator of a linearly generated matrix sequence and has been first introduced by [Rissanen 1972a], [Dickinson et al. 1974] and [Coppersmith 1994]. Our version of the...

متن کامل

The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link

The two primary decoding algorithms for Reed-Solomon codes are the Berlekamp-Massey algorithmand the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. In this article an alternative version of the key equation and a newway to use the Euclidean algorithm to solve it are presented, which yield the Berlekamp-Massey algorithm. This results in a new, simpl...

متن کامل

New permutation codes using Hadamard unscrambling

Another viewpoint is presented on the derivation of theBerlekamp-Massey algorithm. Our approach differs from previous ones inthe following manner. The properties of the shortest linear feedback shiftregister that generates a given sequence are first derived without referenceto the Berlekamp-Massey algorithm. The Berlekamp-Massey algorithm isthen derived using these propertie...

متن کامل

New serial architecture for the Berlekamp-Massey algorithm

We propose a new efficient serial architecture to implement the Berlekamp–Massey algorithm, which is frequently used in BCH and Reed–Solomon decoders. An inversionless Berlekamp–Massey algorithm is adopted which not only eliminates the finite-field inverter but also introduces additional parallelism. We discover a clever scheduling of three finite-field multipliers to implement the algorithm ve...

متن کامل

From the Euclidean Algorithm for Solving a Key Equation for Dual Reed-Solomon Codes to the Berlekamp-Massey Algorithm

The twoprimary decoding algorithms forReed-Solomon codes are the Berlekamp-Massey algorithm and the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. This article presents a new version of the key equation and a way to use the Euclidean algorithm to solve it. A straightforward reorganization of the algorithm yields the Berlekamp-Massey algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Electronic Testing

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2010